Typed Reductions of CLS
نویسنده
چکیده
The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. We enrich this calculus with a type discipline, derived from the requirement of certain elements and the repellency of others, and a type semantic, based on rules respecting different biological properties.
منابع مشابه
The Comparison of Typed and Handwritten Essays of Iranian EFL Students in terms of Length, Spelling, and Grammar
This study attempted to compare typed and handwritten essays of Iranian EFL students in terms of length, spelling, and grammar. To administer the study, the researchers utilized Alice Touch Typing Tutor software to select 15 upper intermediate students with higher ability to write two essays: one typed and the other handwritten. The students were both males and females between the ages of 22 to...
متن کاملMedical students points of view on clinical skill lab function in 8 month period
Introduction. Considering rights of patients and presence of a need for a standard clinical skills learning setting in recent 3 decades, it seems necessary to encourage decision – makers of medical education to establish clinical skills laboratory, in order to minimize unnecessary practices and possible injuries and reduce stress over students. CLS in TUMS was established in 2001. In planning...
متن کاملDiscovering Needed Reductions Using Type Theory
The identiication of the needed redexes in a term is an undecidable problem. We introduce a (partially decidable) type assignment system, which distinguishes certain redexes called the allowable redexes. For a well-typed term e, allowable redexes are needed redexes. In addition, with principal typing, all the needed redexes of a normalisable term are allowable. Using these results, we can ident...
متن کاملMonad Translating Inductive and Coinductive Types
We show that the call-by-name monad translation of simply typed lambda calculus extended with sum and product types extends to special and general inductive and coinductive types so that its crucial property of preserving typings and βand commuting reductions is maintained. Specific similar-purpose translations such as CPS translations follow from the general monad translations by specializatio...
متن کاملExtensional Isomorphisms of Inductive Types in Simply-Typed Lambda-Calculus
We study isomorphisms of types in the system of simply-typed λ-calculus with inductive types and recursion. It is shown that in some cases (multiproducts, copies of types), it is possible to add new reductions in such a way that strong normalisation and confluence of the calculus is preserved, and the isomorphisms may be regarded as intensional w.r.t. a stronger equality relation.
متن کامل